package hot_100;

public class 不同路径 {
    public static void main(String[] args) {

    }

    public int uniquePaths(int m, int n) {
        int[] dp = new int[n + 1];
        dp[1] = 1;
        for (int i = 0; i < m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[j] = dp[j] + j == 1 ? 0 : dp[j - 1];
            }
        }
        return dp[n];
    }
}
